Abstract
In this paper we consider hybrid (fast stochastic approximation and deterministic refinement) algorithms for Matrix Inversion (MI) and Solving Systems of Linear Equations (SLAE). Monte Carlo methods are used for the stochastic approximation, since it is known that they are very efficient in finding a quick rough approximation of the element or a row of the inverse matrix or finding a component of the solution vector. We show how the stochastic approximation of the MI can be combined with a deterministic refinement procedure to obtain MI with the required precision and further solve the SLAE using MI. We employ a splitting A = D – C of a given non-singular matrix A, where D is a diagonal dominant matrix and matrix C is a diagonal matrix. In our algorithm for solving SLAE and MI different choices of D can be considered in order to control the norm of matrix T = D − 1 C, of the resulting SLAE and to minimize the number of the Markov Chains required to reach given precision. Further we run the algorithms on a mini-Grid and investigate their efficiency depending on the granularity. Corresponding experimental results are presented.
Chapter PDF
Similar content being viewed by others
Keywords
References
Fathi, B., Liu, B., Alexandrov, V.: Mixed Monte Carlo Parallel Algorithms for Matrix Computation. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002. LNCS, vol. 2330, pp. 609–618. Springer, Heidelberg (2002)
Ortega, J.: Numerical Analysis. SIAM, USA (1990)
Alexandrov, V.N.: Efficient parallel Monte Carlo Methods for Matrix Computation. In: Mathematics and computers in Simulation, vol. 47, pp. 113–122. Elsevier, Netherlands (1998)
Golub, G.H., Van Loan, C.F.: Matrix Computations. The Johns Hopkins Univ. Press, Baltimore (1996)
Taft, K., Fathi Vajargah, B.: Monte Carlo Method for Solving Systems of Linear Algebraic Equations with Minimum Markov Chains. In: International Conference PDPTA 2000, Las Vegas (2000)
Sobol, I.M.: Monte Carlo Numerical Methods, Moscow, Nauka (1973) (in Russian)
Dimov, I., Alexandrov, V.N., Karaivanova, A.: Resolvent Monte Carlo Methods for Linear Algebra Problems. Mathematics and Computers in Simulation 155, 25–36 (2001)
Fathi Vajargah, B., Alexandrov, V.N.: Coarse Grained Parallel Monte Carlo Algorithms for Solving Systems of Linear Equations with Minimum Communication. In: Proc. of PDPTA, Las Vegas, June 2001, pp. 2240–2245 (2001)
Alexandrov, V.N., Karaivanova, A.: Parallel Monte Carlo Algorithms for Sparse SLAE using MPI. In: Margalef, T., Dongarra, J., Luque, E. (eds.) PVM/MPI 1999. LNCS, vol. 1697, pp. 283–290. Springer, Heidelberg (1999)
Alexandrov, V.N., Rau-Chaplin, A., Dehne, F., Taft, K.: Efficient Coarse Grain Monte Carlo Algorithms for matrix computation using PVM. In: Alexandrov, V.N., Dongarra, J. (eds.) PVM/MPI 1998. LNCS, vol. 1497, pp. 323–330. Springer, Heidelberg (1998)
Dimov, I.T., Dimov, T.T., et al.: A new iterative Monte Carlo Approach for Inverse Matrix Problem. J. of Computational and Applied Mathematics 92, 15–35 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alexandrov, V., Atanassov, E., Dimov, I., Branford, S., Thandavan, A., Weihrauch, C. (2005). Parallel Hybrid Monte Carlo Algorithms for Matrix Computations. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428862_102
Download citation
DOI: https://doi.org/10.1007/11428862_102
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26044-8
Online ISBN: 978-3-540-32118-7
eBook Packages: Computer ScienceComputer Science (R0)